package AcWing周赛;

import java.util.Scanner;

/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: a
 * Date: 2022-08-21
 * Time: 11:43
 */
public class Demo65_3 {
    private static int MAX = (int)1e9;
    private static int N = 300010;

    public static void main(String[] args) {
        int[] x = new int[N];
        int[] y = new int[N];
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int u = -MAX, d = MAX, l = MAX, r = -MAX;
        for(int i = 0; i < n; i++){
            x[i] = scanner.nextInt();
            y[i] = scanner.nextInt();
            u = Math.max(u, y[i]); d = Math.min(d, y[i]);
            l = Math.min(l, x[i]); r = Math.max(r, x[i]);
        }
        //枚举k = 3的情况
        int res = 0;
        for(int i = 0; i < n; i++){
            res = Integer.max(res, Integer.max(u - y[i], y[i] - d) + Integer.max(r - x[i], x[i] - l));
        }
        System.out.print(2 * res + " ");
        //遍历k >= 4的情况
        for(int i = 4; i <= n; i++){
            System.out.print(2 * (u - d + r - l) + " ");
        }
    }
}
